Integer Linear Programming Models for the Containership Stowage Problem
نویسندگان
چکیده
منابع مشابه
Integer linear programming models for the skiving stock problem
We consider the one-dimensional skiving stock problem which is strongly related to the dual bin packing problem: find the maximum number of items with minimum length L that can be constructed by connecting a given supply ofm ∈ N smaller item lengths l1, . . . , lm with availabilities b1, . . . , bm. For this optimization problem, we present three new models (the arcflowmodel, the onestick model...
متن کاملNew Integer Linear Programming Models for the Vertex Coloring Problem
The vertex coloring problem asks for the minimum number of colors that can be assigned to the vertices of a given graph such that for all vertices v the color of v is different from the color of any of its neighbors. The problem is NP-hard. Here, we introduce new integer linear programming formulations based on partial orderings. They have the advantage that they are as simple to work with as t...
متن کاملInteger linear programming models for a cement delivery problem
We consider a cement delivery problem with an heterogeneous fleet of vehicles and several depots. The demands of the customers are typically larger than the capacity of the vehicles which means that most customers are visited several times. This is a split delivery vehicle routing problem with additional constraints. We first propose a two phase solution method that assigns deliveries to the ve...
متن کاملFuzzy Integer Linear Programming Mathematical Models for Examination Timetable Problem
Examination Timetable Problem (ETP) is NP–Hard combinatorial optimization problem. It has received tremendous research attention during the past few years given its wide use in universities. ETP can be defined as assignment of courses to be examined, candidates to time periods and examination rooms while satisfying a set of constraints which may be either hard or soft. Several methods have been...
متن کاملOn the integer max-linear programming problem
For a generic class of matrices we show that integer solutions to two-sided max-linear systems and programs can be found in polynomial time. For general matrices we adapt the existing methods for finding real solutions to obtain algorithms for finding integer solutions.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2020
ISSN: 1563-5147,1024-123X
DOI: 10.1155/2020/4382745